Reservoir Lithology Determination by Hidden Markov Random Fields Based on a Gaussian Mixture Model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalised Mixture Estimation and Unsupervised Classification Based on Hidden Markov Chains and Hidden Markov Random Fields

Hidden Markov chain (HMC) models, applied to a HilbertPeano scan of the image, constitute a fast and robust alternative to hidden Markov random field (HMRF) models for spatial regularisation of image analysis problems, even though the latter provide a finer and more intuitive modelling of spatial relationships. In the framework of generalised mixture estimation and unsupervised classification o...

متن کامل

Approximating Hidden Gaussian Markov Random Fields

This paper discusses how to construct approximations to a unimodal hidden Gaussian Markov random field on a graph of dimensionnwhen the likelihood consists of mutually independent data. We demonstrate that a class of non-Gaussian approximations can be constructed for a wide range of likelihood models. They have the appealing properties that exact samples can be drawn from them, the normalisatio...

متن کامل

Hidden Markov Random Fields

A noninvertible function of a first order Markov process, or of a nearestneighbor Markov random field, is called a hidden Markov model. Hidden Markov models are generally not Markovian. In fact, they may have complex and long range interactions, which is largely the reason for their utility. Applications include signal and image processing, speech recognition, and biological modeling. We show t...

متن کامل

EM algorithms of Gaussian mixture model and hidden Markov model

The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Model) is a finite mixture probability distribution model. Although the two models have a close relationship, they are always discussed independently and separately. The EM (Expectation-Maximum) algorithm is a general me...

متن کامل

NORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET Approximating Hidden Gaussian Markov Random Fields

This paper discusses how to construct approximations to a unimodal hidden Gaussian Markov random field on a graph of dimension n when the likelihood consists of mutually independent data. We demonstrate that a class of non-Gaussian approximations can be constructed for a wide range of likelihood models. They have the appealing properties that exact samples can be drawn from them, the normalisat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Geoscience and Remote Sensing

سال: 2018

ISSN: 0196-2892,1558-0644

DOI: 10.1109/tgrs.2018.2841059